hash function - определение. Что такое hash function
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое hash function - определение

Найдено результатов: 1932
hash function         
<programming> A hash coding function which assigns a data item distinguished by some "key" into one of a number of possible "hash buckets" in a hash table. The hash function is usually combined with another more precise function. For example a program might take a string of letters and put it in one of twenty six lists depending on its first letter. Ideally, a hash function should distribute items evenly between the buckets to reduce the number of hash collisions. If, for example, the strings were names beginning with "Mr.", "Miss" or "Mrs." then taking the first letter would be a very poor hash function because all names would hash the same. (1997-08-03)
Hash function         
A hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes.
one-way hash function         
SPECIAL CLASS OF HASH FUNCTION THAT HAS CERTAIN PROPERTIES WHICH MAKE IT SUITABLE FOR USE IN CRYPTOGRAPHY
Message digest; Cryptographic hash; Cryptographic message digest; One-way hash; Modification Detection Code; Cryptographic hash functions; Hash function (cryptography); One-way hash function; CRHF; Secure hash function; One way encryption; Numerical hash; Cryptograhic hash; Cryptographic hash value; Cryptographic Hash Function; Cryptographic one-way hash function; Message-digest; Message-digest algorithm; Sphincter hash; Terahash; Cryptographic hashing; Wide pipe; Wide pipe hash; Wide pipe design; Wide pipe construction; Wide-pipe; Widepipe; Narrowpipe; Narrow-pipe; Narrow pipe; Applications of cryptographic hash functions; Cryptographic hashes; Hash (cryptography)
<algorithm> (Or "message digest function") A {one-way function} which takes a variable-length message and produces a fixed-length hash. Given the hash it is computationally infeasible to find a message with that hash; in fact one can't determine any usable information about a message with that hash, not even a single bit. For some one-way hash functions it's also computationally impossible to determine two messages which produce the same hash. A one-way hash function can be private or public, just like an encryption function. MD5, SHA and Snefru are examples of public one-way hash functions. A public one-way hash function can be used to speed up a public-key digital signature system. Rather than sign a long message, which can take a long time, compute the one-way hash of the message, and sign the hash. {sci.crypt FAQ (ftp://src.doc.ic.ac.uk/usenet/usenet-by-group/sci.crypt/)}. (2001-05-10)
Hash function security summary         
PUBLICLY KNOWN ATTACKS AGAINST CRYPTOGRAPHIC HASH FUNCTIONS
Hash function security; Hash security summary; Hash security; Hash function security overview
This article summarizes publicly known attacks against cryptographic hash functions. Note that not all entries may be up to date.
LSH (hash function)         
  • Two-word mix function <math> \textrm{Mix}_{j,l} (X, Y) </math>
  • The <math> j </math>-th step function <math> \textrm{Step}_j </math>
  • Compression function of LSH
CRYPTOGRAPHIC HASH FUNCTION
Draft:LSH (hash function)
LSH is a cryptographic hash function designed in 2014 by South Korea to provide integrity in general-purpose software environments such as PCs and smart devices. LSH is one of the cryptographic algorithms approved by the Korean Cryptographic Module Validation Program (KCMVP).
NIST hash function competition         
COMPETITION TO DEVELOP SHA-3
SHA-3 competition; Nist hash function competition; NIST SHA-3 competition; SHA-3 hash function competition
The NIST hash function competition was an open competition held by the US National Institute of Standards and Technology (NIST) to develop a new hash function called SHA-3 to complement the older SHA-1 and SHA-2. The competition was formally announced in the Federal Register on November 2, 2007.
Perfect hash function         
  • A minimal perfect hash function for the four names shown
SET OF HASH FUNCTIONS GENERATE NO COLLISIONS
Perfect hashing; Minimal perfect hashing; Perfect hash; Perfect Hashing; Sloppy hashing; Minimal perfect hash function; MPHF
In computer science, a perfect hash function for a set is a hash function that maps distinct elements in to a set of integers, with no collisions. In mathematical terms, it is an injective function.
Security of cryptographic hash functions         
In cryptography, cryptographic hash functions can be divided into two main categories. In the first category are those functions whose designs are based on mathematical problems, and whose security thus follows from rigorous mathematical proofs, complexity theory and formal reduction.
Universal one-way hash function         
TYPE OF UNIVERSAL HASH FUNCTION IN CRYPTOGRAPHY PROPOSED AS AN ALTERNATIVE TO COLLISION-RESISTANT HASH FUNCTIONS
Uowhf; UOWHF; Unversal one-way hash function
In cryptography a universal one-way hash function (UOWHF, often pronounced "woof"), is a type of universal hash function of particular importance to cryptography. UOWHF's are proposed as an alternative to collision-resistant hash functions (CRHFs).
Jenkins hash function         
COLLECTION OF HASH FUNCTIONS
Jenkins hash; SpookyHash
The Jenkins hash functions are a collection of (non-cryptographic) hash functions for multi-byte keys designed by Bob Jenkins. The first one was formally published in 1997.

Википедия

Hash function
A hash function is any function that can be used to map data of arbitrary size to fixed-size values. The values returned by a hash function are called hash values, hash codes, digests, or simply hashes.